Analytical Results on the BFS vs . DFS Algorithm Selection Problem
نویسندگان
چکیده
Breadth-first search (BFS) and depth-first search (DFS) are the two most fundamental search algorithms. We derive approximations of their expected runtimes in complete trees, as a function of tree depth and probabilistic goal distribution. We also demonstrate that the analytical approximations are close to the empirical averages for most parameter settings, and that the results can be used to predict the best algorithm given the relevant problem features.
منابع مشابه
Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search
The algorithm selection problem asks to select the best algorithm for a given problem. In the companion paper Everitt and Hutter (2015b), expected runtime was approximated as a function of search depth and probabilistic goal distribution for tree search versions of breadth-first search (BFS) and depth-first search (DFS). Here we provide an analogous analysis of BFS and DFS graph search, derivin...
متن کاملA Topological Approach to Meta-heuristics: Analytical Results on the BFS vs. DFS Algorithm Selection Problem
Search is a central problem in artificial intelligence, and BFS and DFS the two most fundamental ways to search. In this report we derive results for average BFS and DFS runtime: For tree search, we employ a probabilistic model of goal distribution; for graph search, the analysis depends on an additional statistic of path redundancy and average branching factor. As an application, we use the re...
متن کاملFrameworks for Designing In-place Graph Algorithms
Read-only memory (ROM) model is a classical model of computation to study time-space tradeoffs of algorithms. One of the classical results on the ROM model is that any sorting algorithm that uses O(s) words of extra space requires Ω(n2/s) comparisons for lg n ≤ s ≤ n/ lg n1 and the bound has also been recently matched by an algorithm. However, if we relax the model (from ROM), we do have sortin...
متن کاملTheory and Techniques for Synthesizing Space-efficient Breadth-first Search Algorithms
Although Breadth-First Search (BFS) has several advantages over DepthFirst Search (DFS) its prohibitive space requirements have meant that algorithm designers often pass it over in favor of DFS. To address this shortcoming, we introduce a theory of space-e cient BFS (SEBFS) along with a simple recursive program schema for carrying out the search. The theory is based on dominance relations, a lo...
متن کاملLinear-Time In-Place DFS and BFS in the Restore Model
We present an in-place depth first search (DFS) and an in-place breadth first search (BFS) that runs in the restore model in linear time. To obtain our results we show several linear-time in-place graph transformations from one representation to another representation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015